Dynamic algorithm selection for runtime concepts
نویسندگان
چکیده
منابع مشابه
Issues in Runtime Algorithm Selection for Grid Environments
The heterogeneity and unpredictability of grid computing environments is a severe challenge to algorithm selection for large-scale scientific codes. This paper discusses a set of requirements for an algorithm selection web service, which supports runtime, context-aware algorithm recommendations in a multi-language, multi-platform environment. An architecture and prototype implementation of such...
متن کاملRuntime Algorithm Selection For Grid Environments: A Component Based Framework
Grid environments are inherently heterogeneous. If the computational power provided by collaborations on the Grid is to be harnessed in the true sense, there is a need for applications that can automatically adapt to changes in the execution environment. The application writer should not be burdened with the job of choosing the right algorithm and implementation every time the resources on whic...
متن کاملPerformance Modeling for Dynamic Algorithm Selection
Adaptive algorithms are an important technique to achieve portable high performance. They choose among solution methods and optimizations according to expected performance on a particular machine. Grid environments make the adaptation problem harder, because the optimal decision may change across runs and even during runtime. Therefore, the performance model used by an adaptive algorithm must b...
متن کاملDynamic Algorithm Selection for Data Mining Classification
Recommending appropriate classification algorithm for given new dataset is very important and useful task but also is full of challenges. According to NO-FREE-LUNCH theorem, there is no best classifier for different classification problems. It is difficult to predict which learning algorithm will work best for what type of data and domain. In this paper, a method of recommending classification ...
متن کاملAnnotation Markers for Runtime Replication Protocol Selection
This paper presents an architecture enabling developers to easily and flexibly assign replication protocols simply by annotating individual server methods. This avoids using costly replication protocols for all object methods, e.g. read-only methods can use less costly protocols, reserving the costly replication protocols for update methods. The architecture has been implemented in the Jgroup/A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2010
ISSN: 0167-6423
DOI: 10.1016/j.scico.2009.04.002